Space Distortion and Monotone Admissibility in Agglomerative Clustering
نویسندگان
چکیده
This paper discusses the admissibility of agglomerative hierarchical clustering algorithms with respect to space distortion and monotonicity, as defined by Yadohisa et al. and Batagelj, respectively. Several admissibilities and their properties are given for selecting a clustering algorithm. Necessary and sufficient conditions for an updating formula, as introduced by Lance and Williams, are provided for the proposed admissibility criteria. A detailed explanation of the admissibility of eight popular algorithms is also given.
منابع مشابه
Admissibilities of Agglomerative Hierarchical Clustering Algorithms with Respect to Space Distortion and Monotonicity
The concept of admissibility with respect to clustering algorithms was introduced by Fisher and Van Ness (1971). They defined types of admissibility of an algorithm and indicated the relationships between these admissibilities and popular clustering algorithms. In recent years, admissibility with respect to space distortion (See, Lance and Williams, 1967) has been proposed by Chen and Van Ness ...
متن کاملAgglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results
We explore the use of instance and cluster-level constraints with agglomerative hierarchical clustering. Though previous work has illustrated the benefits of using constraints for non-hierarchical clustering, their application to hierarchical clustering is not straight-forward for two primary reasons. First, some constraint combinations make the feasibility problem (Does there exist a single fe...
متن کاملAn On-line Agglomerative Clustering Method for Non-Stationary Data
An on-line agglomerative clustering algorithm for nonstationary data is described. Three issues are addressed. The first regards the temporal aspects of the data. The clustering of stationary data by the proposed algorithm is comparable to the other popular algorithms tested (batch and on-line). The second issue addressed is the number of clusters required to represent the data. The algorithm p...
متن کاملColor Image Segmentation Using Anisotropic Diffusion and Agglomerative Hierarchical Clustering
A new color image segmentation scheme is presented in this paper. The proposed algorithm consists of image simplification, region labeling and color clustering. The vector-valued diffusion process is performed in the perceptually uniform LUV color space. We present a discrete 3-D diffusion model for easy implementation. The statistical characteristics of each labeled region are employed to esti...
متن کاملDiversity-Driven Widening of Hierarchical Agglomerative Clustering
In this paper we show that diversity-driven widening, the parallel exploration of the model space with focus on developing diverse models, can improve hierarchical agglomerative clustering. Depending on the selected linkage method, the model that is found through the widened search achieves a better silhouette coefficient than its sequentially built counterpart.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001